package leetcode.D200.T113;

import util.ListUtil;
import util.TreeNode;
import util.TreeUtil;

/**
 * @Author: duyuzhou
 * @Create: 2022-04-07 23:13:28 星期四
 */
public class M113 {
    public static void main(String[] args) {
        TreeNode root = TreeUtil.deserialize("[5,4,8,11,null,13,4,7,2,null,null,5,1]");
        ListUtil.printIntListList(new Solution().pathSum(root, 22));
    }
}
